Discrete Logarithm and Integer Factorization using ID-based Encryption
نویسندگان
چکیده
منابع مشابه
Integer factorization and discrete logarithm problems
These are notes for a lecture given at CIRM in 2014, for the Journées Nationales du Calcul Formel . We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Gröbner basis in Joux's algorithm for discrete lo...
متن کاملThe filtering step of discrete logarithm and integer factorization algorithms
The security of most current public-key cryptosystems is based on the difficulty of finding discrete logarithms in large finite fields or factoring large integers. Most discrete logarithm and integer factoring algorithms, such as the Number Field Sieve (NFS) or the Function Field Sieve (FFS), can be described in 3 main steps: data collection, filtering and linear algebra. The goal of the filter...
متن کاملAn ID-Based Public Key Cryptosystem based on Integer Factoring and Double Discrete Logarithm Problem
In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communicatio...
متن کاملInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm Problem
Problem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithms with subexponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still n...
متن کاملA New Public Key Scheme Based on Integer Factorization and Discrete Logarithm
In this paper, we present a new public key scheme which is a combination of RSA variant namely the Dependent-RSA (DRSA) and the general formulation of DGDLP. The security of this scheme depend equally on the integer factorization of n and the discrete logarithm on Zn, where n is a product of two large primes and Zn is the multiplicative group modulo n. The scheme is a randomized algorithm and i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Electrical Engineering and Informatics
سال: 2015
ISSN: 2302-9285,2089-3191
DOI: 10.11591/eei.v4i2.437